Dynamic data reallocation in disk arrays

Designing Disk Arrays for High Data Reliability

Redundancy based on a parity encoding has been proposed for insuring that disk arrays provide highly reliable data. Parity-based redundancy will tolerate many independent and dependent disk failures (shared support hardware) without on-line spare disks and many more such failures with on-line spare disks. This paper explores the design of reliable, redundant disk arrays. In the context of a 70 ...

Dynamic Reallocation Problems in Scheduling

In this paper we look at the problem of scheduling tasks on a single-processor system, where each task requires unit time and must be scheduled within a certain time window, and each task can be added to or removed from the system at any time. On each operation, the system is allowed to reschedule any tasks, but the goal is to minimize the number of rescheduled tasks. Our main result is an allo...

On-Line Data Reconstruction In Redundant Disk Arrays

Hot Block Clustering for Disk Arrays with Dynamic Striping

RAID5 disk arrays provide high performance and high reliability for reasonable cost. However RAID5 suffers a performance penalty during block updates. In order to overcome this problem, the use of dynamic striping was proposed. This method buffers a number of updates, generates a new stripe composed of newly updated blocks, and then writes the new full stripe back to disks. In this paper, we ex...

Hot Block Clustering for Disk Arrays with Dynamic

RAID5 disk arrays provide high performance and high reliability for reasonable cost. However RAID5 suffers a performance penalty during block updates. In order to overcome this problem, the use of dynamic striping was proposed. This method bu ers a number of updates, generates a new stripe composed of newly updated blocks, and then writes the new full stripe back to disks. In this paper, we exa...